Molecular Sticker Model Stimulation on Silicon for a Maximum Clique Problem
نویسندگان
چکیده
Molecular computers (also called DNA computers), as an alternative to traditional electronic computers, are smaller in size but more energy efficient, and have massive parallel processing capacity. However, DNA computers may not outperform electronic computers owing to their higher error rates and some limitations of the biological laboratory. The stickers model, as a typical DNA-based computer, is computationally complete and universal, and can be viewed as a bit-vertically operating machine. This makes it attractive for silicon implementation. Inspired by the information processing method on the stickers computer, we propose a novel parallel computing model called DEM (DNA Electronic Computing Model) on System-on-a-Programmable-Chip (SOPC) architecture. Except for the significant difference in the computing medium--transistor chips rather than bio-molecules--the DEM works similarly to DNA computers in immense parallel information processing. Additionally, a plasma display panel (PDP) is used to show the change of solutions, and helps us directly see the distribution of assignments. The feasibility of the DEM is tested by applying it to compute a maximum clique problem (MCP) with eight vertices. Owing to the limited computing sources on SOPC architecture, the DEM could solve moderate-size problems in polynomial time.
منابع مشابه
Fast Parallel Solution for Set-Packing and Clique Problems by DNA-Based Computing
This paper shows how to use sticker to construct solution space of DNA for the library sequences in the set-packing problem and the clique problem. Then, with biological operations, we propose DNAbased algorithms to remove illegal solutions and to find legal solutions for the set-packing and clique problems from the solution space of sticker. Any NP-complete problem in Cook’s Theorem can be red...
متن کاملFast parallel bio-molecular solutions: the set-basis problem
In the paper, it is demonstrated how to apply sticker in the sticker-based model for constructing solution space of DNA for the setbasis problem and how to apply DNA operations in the Adleman-Lipton model to solve that problem from solution space of sticker. Furthermore, this work shows the ability of DNA-based computing for resolving the NP-complete problems.
متن کاملA Neural Network Model for Finding a Near-Maximum Clique
A parallel algorithm based on the neural network model for finding a near-maximum clique is presented in this paper. A maximum clique of a graph G is a maximum complete subgraph of G where any two vertices are adjacent. The problem of finding a maximum clique is NP-complete. The parallel algorithm requires n processing elements for an n-vertex graph problem. The algorithm is verified by solving...
متن کاملSolving the 0/1 Knapsack Problem by a Biomolecular DNA Computer
Solving some mathematical problems such as NP-complete problems by conventional silicon-based computers is problematic and takes so long time. DNA computing is an alternative method of computing which uses DNA molecules for computing purposes. DNA computers have massive degrees of parallel processing capability. The massive parallel processing characteristic of DNA computers is of particular in...
متن کاملAn Improved Transiently Chaotic Neural Network to Maximum Clique Problem
By analyzing the dynamics behavior and parameter distribution of the transiently chaotic neural network, we propose an improved transiently neural network model with new embedded back-end chaotic dynamics for combinatorial optimization problem and test it on the maximum clique problem. With the new embedded back-end chaotic dynamics, the proposed model can get enough chaotic dynamics to do glob...
متن کامل